A New Class of Orthogonal Polynomials1
نویسنده
چکیده
A new class of orthogonal polynomials is introduced which generalizes the Bernstein-Szegö polynomials and includes the associated polynomials as well. The purpose of this paper is to give a natural extension of the Bernstein-Szegö orthogonal polynomials for a general class of weight functions. A nonnegative function w defined on the real line is called a weight function if w > 0, fRw > 0 and all the moments of w are finite. For a given weight w one can construct a unique system of polynomials {pn(w)}TM=0 such thatpn(w, x) = yn(w)x" + ' ' ' >' Y„(w) > O» and ÍRPn(w)Pm(w)w = &mnThe Bernstein-Szegö orthogonal polynomials [13, §2.6] are the ones corresponding to the weight w defined by (1) w(x) = (l-x)±1/2(\+x)±l/2/p(x), -1<JC.<1, with w supported in [-1,1] where p is a positive polynomial in [-1,1], and these polynomials play a fundamental role in Szegö's theory, in particular, they are used to solve Szegö's extremal problem, they are applied to obtain Bernstein-Szegö's asymptotics for orthogonal polynomials, and they make it possible to prove theorems about equiconvergence of orthogonal polynomial series and Fourier series [5-7 and 13]. If g g L*(R) then the Stieltjes transform S(g) of g is defined by
منابع مشابه
Solving a class of nonlinear two-dimensional Volterra integral equations by using two-dimensional triangular orthogonal functions
In this paper, the two-dimensional triangular orthogonal functions (2D-TFs) are applied for solving a class of nonlinear two-dimensional Volterra integral equations. 2D-TFs method transforms these integral equations into a system of linear algebraic equations. The high accuracy of this method is verified through a numerical example and comparison of the results with the other numerical methods.
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملOn a class of locally projectively flat Finsler metrics
In this paper we study Finsler metrics with orthogonal invariance. We find a partial differential equation equivalent to these metrics being locally projectively flat. Some applications are given. In particular, we give an explicit construction of a new locally projectively flat Finsler metric of vanishing flag curvature which differs from the Finsler metric given by Berwald in 1929.
متن کاملOrthogonality preserving mappings on inner product C* -modules
Suppose that A is a C^*-algebra. We consider the class of A-linear mappins between two inner product A-modules such that for each two orthogonal vectors in the domain space their values are orthogonal in the target space. In this paper, we intend to determine A-linear mappings that preserve orthogonality. For this purpose, suppose that E and F are two inner product A-modules and A+ is the set o...
متن کاملSome New Properties of the Searching Probability
Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...
متن کامل